Pushdown Automata in Statistical Machine Translation

Pushdown Automata in Statistical Machine Translation

This paper describes the use of pushdown automata (PDA) in the context of statistical machine translation and alignment under a synchronous context-free grammar. We use PDAs to compactly represent the space of candidate translations generated by the grammar when applied to an input sentence. General-purpose PDA algorithms for replacement, composition, shortest path, and expansion are presented....

Pushdown Automata

Families of Languages AFL thm if F is closed under substitution with λ-free regular sets, morphism, union with regular sets [easy for cfg] & intersection with regular sets, then F is closed under inverse morphism Figure 26: closure properties of CF II 12 intersection with regular languages a;A/α a a;A/α λ;A/α λ;A/α { } } { ⇒ ⇒ { anbn | n ≥ 1 }∗ ∩ { w ∈ {a, b}∗ |#ax even } r1 p1 q1 r0 p0 q0 r p ...

Statistical Machine Translation

Statistical Machine Translation (SMT) deals with automatically mapping sentences in one human language (for example French) into another human language (such as English). The first language is called the source and the second language is called the target. This process can be thought of as a stochastic process. There are many SMT variants, depending upon how translation is modelled. Some approa...

Discourse in Statistical Machine Translation

Avertissement Le contenu de ce site relève de la législation française sur la propriété intellectuelle et est la propriété exclusive de l'éditeur. Les œuvres figurant sur ce site peuvent être consultées et reproduites sur un support papier ou numérique sous réserve qu'elles soient strictement réservées à un usage soit personnel, soit scientifique ou pédagogique excluant toute exploitation comme...

Topics in Statistical Machine Translation